A SURVEY ON HEURISTICS FOR THE TWO-DIMENSIONAL RECTANGULAR STRIP PACKING PROBLEM
نویسندگان
چکیده
منابع مشابه
One-dimensional heuristics adapted for two-dimensional rectangular strip packing
We consider two-dimensional rectangular strip packing without rotation of items and without the guillotine cutting constraint. We propose a single-pass heuristic which fills every free space in a onedimensional knapsack fashion, i.e. considering only item widths. It appears especially important to assign suitable heuristic “pseudo-values” as profits in this knapsack problem. This simple heurist...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملA Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we run a memetic algorithm-based hyper-heuristic (HH). The basic technique of this HH is a memory-based evolutionary technique, the “extended virtual loser” (EVL). The memory-based techn...
متن کاملA genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the pieces within the container, without overlapping, such that the overall length of the layout is minimised. Until now mainly heuristics, for example genetic algorithms (GA), were proposed for the 2D-SPP which use encoded...
متن کاملA genetic algorithm for the two-dimensional strip-packing problem
The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the container-loading problem (CLP) with a single container to be loaded. The characteristic features of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2016
ISSN: 0101-7438
DOI: 10.1590/0101-7438.2016.036.02.0197